1709C - Recover an RBS - CodeForces Solution

constructive algorithms greedy implementation strings

Please click on ads to support us..

Python Code: 

import sys

lines = sys.stdin.readlines()
cur_line = -1

def input():
    global lines, cur_line
    cur_line += 1
    return lines[cur_line][:-1]


for _ in range(int(input())):
    s = input()
    op = s.count('(')
    cl = s.count(')')
    q = s.count('?')

    toop = max(0, cl - op) + (len(s) - 2*max(op, cl)) // 2
    tocl = max(0, op - cl) + (len(s) - 2*max(op, cl)) // 2


    if min(toop, tocl) == 0:
        print("YES")
        continue
    
    t = list(s)
    inv = False
    for i in range(len(s)):
        if t[i] == '?':
            if toop > 1:
                toop -= 1
                t[i] = '('
            elif toop == 1 and not inv:
                inv = True
                t[i] = ')'
            elif toop > 0:
                t[i] = '('
                toop -= 1
            else:
                t[i] = ')'

    x = 0
    pos = True
    for c in t:
        if c == '(':
            x += 1
        else:
            x -= 1
        if x < 0:
            pos = False

    print("YES" if not pos else "NO")

C++ Code: 

#include<iostream>
#include<cstring>
#include<queue>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#define int long long
using namespace std;
const int N=200010;
bool flag[26];



void solve(){
	int n,k,cnt=0,q=0;
    string s;
    cin>>s;
    for (char c : s) {
        if (c == '(')cnt++;
        if (c == ')')cnt--;
        if (c == '?')q++;
        if (cnt + q == 1) {
            cnt = 1;
            q = 0;
        }
    }
    if (abs(cnt) == q) cout<<"YES\n";
    else cout<<"NO\n";
    return;
}
//(??)==>no    (?)(?)==>yes(()())
//?((?(???==>((()())
signed main(void)
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T;
    cin>>T;
    while(T--){
        solve();
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

1047. Remove All Adjacent Duplicates In String
977. Squares of a Sorted Array
852. Peak Index in a Mountain Array
461. Hamming Distance
1748. Sum of Unique Elements
897. Increasing Order Search Tree
905. Sort Array By Parity
1351. Count Negative Numbers in a Sorted Matrix
617. Merge Two Binary Trees
1450. Number of Students Doing Homework at a Given Time
700. Search in a Binary Search Tree
590. N-ary Tree Postorder Traversal
589. N-ary Tree Preorder Traversal
1299. Replace Elements with Greatest Element on Right Side
1768. Merge Strings Alternately
561. Array Partition I
1374. Generate a String With Characters That Have Odd Counts
1822. Sign of the Product of an Array
1464. Maximum Product of Two Elements in an Array
1323. Maximum 69 Number
832. Flipping an Image
1295. Find Numbers with Even Number of Digits
1704. Determine if String Halves Are Alike
1732. Find the Highest Altitude
709. To Lower Case
1688. Count of Matches in Tournament
1684. Count the Number of Consistent Strings
1588. Sum of All Odd Length Subarrays
1662. Check If Two String Arrays are Equivalent
1832. Check if the Sentence Is Pangram